Sur une conjecture d'Yves MétivierBERTRAND, A.Theoretical computer science. 1994, Vol 123, Num 1, pp 21-30, issn 0304-3975Conference Paper

The laterality problem for non-erasing turing machines on {0,1} is completely solvedMARGENSTERN, M.Informatique théorique et applications (Imprimé). 1997, Vol 31, Num 2, pp 159-204, issn 0988-3754Article

Efficient special cases of Pattern Matching with SwapsAMIR, A; LANDAU, G. M; LEWENSTEIN, M et al.Information processing letters. 1998, Vol 68, Num 3, pp 125-132, issn 0020-0190Article

Avicenne et le soufisme : à propos de la Risala nayruziyya = Avicenna and the sufism: on the Risāla nayrūziyyaLORY, P.Bulletin d'études orientales. 1996, Vol 48, pp 137-144, issn 0253-1623, 10 p.Article

The four cases of write unidirectional memory codes over arbitrary alphabetsVAN OVERVELD, W. M. C. J.IEEE transactions on information theory. 1991, Vol 37, Num 3, pp 872-878, issn 0018-9448, 1Article

A fast algorithm for optimum height-limited alphabetic binary treesLARMORE, L. L; PRZYTYCKA, T. M.SIAM journal on computing (Print). 1994, Vol 23, Num 6, pp 1283-1312, issn 0097-5397Article

Unavoidable binary patternsCASSAIGNE, J.Acta informatica. 1993, Vol 30, Num 4, pp 385-395, issn 0001-5903Article

A note on the paper disjunctive languages and compatible ordersITO, M.Informatique théorique et applications (Imprimé). 1991, Vol 25, Num 5, pp 419-421, issn 0988-3754Article

L'acquisition de la lecture: perspective cognitivesALEGRIA, J.Quest Logop. 1988, Vol 3, Num 0019, pp 00099-00121Article

Compressed index for dynamic textHON, Wing-Kai; LAM, Tak-Wah; SADAKANE, Kunihiko et al.Data Compression Conference. 2004, pp 102-111, isbn 0-7695-2082-0, 1Vol, 10 p.Conference Paper

Example verifications using alphabet axiomsKORVER, H; SELLINK, A.Formal aspects of computing. 1998, Vol 10, Num 1, pp 43-58, issn 0934-5043Article

Polynomial size test sets for commutative languagesHAKALA, I; KORTELAINEN, J.Informatique théorique et applications (Imprimé). 1997, Vol 31, Num 3, pp 291-304, issn 0988-3754Article

On the average minimal prefix-length of the generalized semi-dycklanguageKEMP, R.Informatique théorique et applications (Imprimé). 1996, Vol 30, Num 6, pp 545-561, issn 0988-3754Article

An application of the hough transform to automatic recognition of Berber charactersOULAMARA, A; DUVERNOY, J.Signal processing. 1988, Vol 14, Num 1, pp 79-90, issn 0165-1684Article

The structure of invertible substitutions on a three-letter alphabetBO TAN; WEN, Zhi-Xiong; YIPING ZHANG et al.Advances in applied mathematics (Print). 2004, Vol 32, Num 4, pp 736-753, issn 0196-8858, 18 p.Article

Parallel detection of all palindromes in a stringAPOSTOLICO, A; BRESLAUER, D; ZVI GALIL et al.Theoretical computer science. 1995, Vol 141, Num 1-2, pp 163-173, issn 0304-3975Article

Parikh mapping and iterationDASSOW, Jürgen.Multiset processing (mathematical, computer science, and molecular computing points of view). Lecture notes in computer science. 2001, pp 85-101, issn 0302-9743, isbn 3-540-43063-6Book Chapter

Prefix-primitive annihilators of languages under some operationsFAN, Chen-Ming; HUANG, Cheng-Chih; CHRISTINE CHIFEN TSENG et al.Acta informatica. 2012, Vol 49, Num 5, pp 281-293, issn 0001-5903, 13 p.Article

On a generalization of Christoffel words: epichristoffel wordsPAQUIN, Geneviève.Theoretical computer science. 2009, Vol 410, Num 38-40, pp 3782-3791, issn 0304-3975, 10 p.Article

Some operations preserving primitivity of wordsDASSOW, Jürgen; MARTIN, Gema M; VICO, Francisco J et al.Theoretical computer science. 2009, Vol 410, Num 30-32, pp 2910-2919, issn 0304-3975, 10 p.Article

On Extracting Common Random Bits From Correlated Sources on Large AlphabetsSIU ON CHAN; MOSSEL, Elchanan; NEEMAN, Joe et al.IEEE transactions on information theory. 2014, Vol 60, Num 3, pp 1630-1637, issn 0018-9448, 8 p.Article

Codes Correcting Single Errors of Limited MagnitudeKLØVE, Torleiv; JINQUAN LUO; YARI, Somaye et al.IEEE transactions on information theory. 2012, Vol 58, Num 4, pp 2206-2219, issn 0018-9448, 14 p.Article

Nonreversibility and equivalent constructions of multiple-unicast networksDOUGHERTY, Randall; ZEGER, Kenneth.IEEE transactions on information theory. 2006, Vol 52, Num 11, pp 5067-5077, issn 0018-9448, 11 p.Article

Exponential-time and subexponential-time setsSHOUWEN TANG; BIN FU; TIAN LIU et al.Theoretical computer science. 1993, Vol 115, Num 2, pp 371-381, issn 0304-3975Article

The shuffle algtebra and its derivationsKATSURA, M; KOBAYASHI, Y.Theoretical computer science. 1993, Vol 115, Num 2, pp 359-369, issn 0304-3975Article